Selecting Complementary Pairs of Literals
نویسندگان
چکیده
We analyze an algorithm that in each free step Selects & Sets to a value a pair of complementary literals of specified corresponding degrees. Unit Clauses, if they exist, are given priority. This algorithm is proved to succeed on input random 3-CNF formulas of density c3 = 3.52+, establishing that the conjectured threshold value for random 3CNF formulas is at least 3.52+.
منابع مشابه
Literal Projection for First-Order Logic
The computation of literal projection generalizes predicate quantifier elimination by permitting, so to speak, quantifying upon an arbitrary sets of ground literals, instead of just (all ground literals with) a given predicate symbol. Literal projection allows, for example, to express predicate quantification upon a predicate just in positive or negative polarity. Occurrences of the predicate i...
متن کاملRESEARCH REPORT On the Complexity of Deduction in Existential Conjunctive First Order Logic with Atomic Negation (Long Version)
We consider the deduction problem in the fragment of first-order logic (FOL) composed of existentially closed conjunctions of literals (without functions), denoted FOL{∃,∧,¬a}. This problem can be recast as several fundamental problems in artificial intelligence and databases, namely query containment for conjunctive queries with negation, clause entailment for clauses without functions and que...
متن کاملDuality in Knowledge Compilation Techniques
Several classes of propositional formulas have been used as target languages for knowledge compilation. Some are based primarily on c-paths (essentially, the clauses in disjunctive normal form); others are based primarily on dpaths. Such duality is not surprising in light of the duality fundamental to classical logic. There is also duality among target languages in terms of how they treat links...
متن کاملMultiple-Valued Logic Operations with Universal Literals
We propose the use of universal literals as a means of reducing the cost of multiple-valued circuits. A universal literal is any function on one variable. The target architecture is a sum-of-products structure, where sum is the truncated sum and product terms consist of the minimum of universal literals. A significant cost reduction is demonstrated over the conventional window literal. The prop...
متن کاملFDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure
FDPLL is a directly lifted version of the well-known DavisPutnam-Logeman-Loveland (DPLL) procedure. While DPLL is based on a splitting rule for case analysis wrt. ground and complementary literals, FDPLL uses a lifted splitting rule, i.e. the case analysis is made wrt. non-ground and complementary literals now. The motivation for this lifting is to bring together successful first-order techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 16 شماره
صفحات -
تاریخ انتشار 2003